A New Incremental Core-Based Clustering Method
نویسندگان
چکیده
Clustering is a data mining activity that aims to differentiate groups inside a given set of objects, with respect to a set of relevant attributes of the analyzed objects. Generally, existing clustering methods, such as k-means algorithm, start with a known set of objects, measured against a known set of attributes. But there are numerous applications where the attribute set characterizing the objects evolves. We propose an incremental, k-means based clustering method, Core Based Incremental Clustering (CBIC), that is capable to re-partition the objects set, when the attribute set increases. The method starts from the partitioning into clusters that was established by applying k-means or CBIC before the attribute set changed. The result is reached more efficiently than running k-means again from the scratch on the feature-extended object set. Experiments proving the method's efficiency are also reported.
منابع مشابه
A Hybrid Framework for Building an Efficient Incremental Intrusion Detection System
In this paper, a boosting-based incremental hybrid intrusion detection system is introduced. This system combines incremental misuse detection and incremental anomaly detection. We use boosting ensemble of weak classifiers to implement misuse intrusion detection system. It can identify new classes types of intrusions that do not exist in the training dataset for incremental misuse detection. As...
متن کاملImprovement of density-based clustering algorithm using modifying the density definitions and input parameter
Clustering is one of the main tasks in data mining, which means grouping similar samples. In general, there is a wide variety of clustering algorithms. One of these categories is density-based clustering. Various algorithms have been proposed for this method; one of the most widely used algorithms called DBSCAN. DBSCAN can identify clusters of different shapes in the dataset and automatically i...
متن کاملAn Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering
Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.
متن کاملIncremental Predictive Command of Velocity to Be Gained Guidance Method
In this paper, a new incremental predictive guidance method based on implicit form of velocity to be gained algorithm is proposed. In this approach, the generalized incremental predictive control (GIPC) approach is applied to the linearized model for compensating the guidance error. Instead of using the present state in popular model based predictive controller (MPC), in the new method both pre...
متن کاملPRFM Model Developed for the Separation of Enterprise Customers Based on the Distribution Companies of Various Goods and Services
In this study, a new model of combining variables affecting the classification of customers is introduced which is based on a distribution system of goods and services. Given the problems that the RFM model has in various distribution systems, a new model for resolving these problems is presented. The core of this model is the older RFM. The new model that has been proposed as PRFM, consists of...
متن کامل